package binarySearch;

//https://leetcode.cn/problems/sqrtx/description/
public class l_69 {
    public int mySqrt(int x) {
        if(x < 1) return 0;
        int left = 1, right = x;
        while(left < right)
        {
            int mid = left + (right - left + 1) / 2;
            //防溢出
            if(mid <= x / mid) left = mid;
            else right = mid - 1;
        }
        return left;
    }
}
